A dichotomous search-based heuristic for the three-dimensional sphere packing problem
نویسندگان
چکیده
منابع مشابه
A dichotomous search-based heuristic for the three-dimensional sphere packing problem
In this paper, the three-dimensional sphere packing problem is solved by using a dichotomous search-based heuristic. An instance of the problem is defined by a set of n unequal spheres and an object of fixed width and height and, unlimited length. Each sphere is characterized by its radius and the aim of the problem is to optimize the length of the object containing all spheres without overlapp...
متن کاملGuided Local Search for the Three-Dimensional Bin-Packing Problem
The three-dimensional bin packing problem is the problem of orthogonally packing a set of boxes into a minimum number of three-dimensional bins. In this paper we present a heuristic algorithm based on Guided Local Search (GLS). Starting with an upper bound on the number of bins obtained by a greedy heuristic, the presented algorithm iteratively decreases the number of bins, each time searching ...
متن کاملA Binary Search Heuristic Algorithm Based on Randomized Local Search for the Rectangular Strip-Packing Problem
T paper presents a binary search heuristic algorithm for the rectangular strip-packing problem. The problem is to pack a number of rectangles into a sheet of given width and infinite height so as to minimize the required height. We first transform this optimization problem into a decision problem. A least-waste-first strategy and a minimal-inflexion-first strategy are proposed to solve the rela...
متن کاملThe sphere packing problem
Hales, T.C., The sphere packing problem, Journal of Computational and Applied Mathematics 44 (1992) 41-76. The sphere packing problem asks whether any packing of spheres of equal radius in three dimensions has density exceeding that of the face-centered-cubic lattice packing (of density IT/V%). This paper sketches a solution to this problem.
متن کاملThe Sphere-Packing Problem
A brief report on recent work on the sphere-packing problem. 1991 Mathematics Subject Classification: 52C17
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Cogent Engineering
سال: 2015
ISSN: 2331-1916
DOI: 10.1080/23311916.2014.994257